Linear convergence of an algorithm for computing the largest eigenvalue of a nonnegative tensor
نویسندگان
چکیده
An iterative method for finding the largest eigenvalue of a nonnegative tensor was proposed by Ng, Qi, and Zhou in 2009. In this paper, we establish an explicit linear convergence rate of the Ng–Qi–Zhou method for essentially positive tensors. Numerical results are given to demonstrate linear convergence of the Ng–Qi–Zhou algorithm for essentially positive tensors. Copyright © 2011 John Wiley & Sons, Ltd.
منابع مشابه
Efficient algorithms for computing the largest eigenvalue of a nonnegative tensor
Consider the problem of computing the largest eigenvalue for nonnegative tensors. In this paper, we establish the Q-linear convergence of a power type algorithm for this problem under a weak irreducibility condition. Moreover, we present a convergent algorithm for calculating the largest eigenvalue for any nonnegative tensors.
متن کاملLinear Convergence of the Lzi Algorithm for Weakly Positive Tensors
We define weakly positive tensors and study the relations among essentially positive tensors, weakly positive tensors, and primitive tensors. In particular, an explicit linear convergence rate of the Liu-Zhou-Ibrahim(LZI) algorithm for finding the largest eigenvalue of an irreducible nonnegative tensor, is established for weakly positive tensors. Numerical results are given to demonstrate linea...
متن کاملA New Inexact Inverse Subspace Iteration for Generalized Eigenvalue Problems
In this paper, we represent an inexact inverse subspace iteration method for computing a few eigenpairs of the generalized eigenvalue problem Ax = Bx [Q. Ye and P. Zhang, Inexact inverse subspace iteration for generalized eigenvalue problems, Linear Algebra and its Application, 434 (2011) 1697-1715 ]. In particular, the linear convergence property of the inverse subspace iteration is preserved.
متن کاملA quadratically convergent algorithm for finding the largest eigenvalue of a nonnegative homogeneous polynomial map
In this paper we propose a quadratically convergent algorithm for finding the largest eigenvalue of a nonnegative homogeneous polynomialmapwhere theNewtonmethod is used to solve an equivalent system of nonlinear equations. The semi-symmetric tensor is introduced to reveal the relation between homogeneous polynomial map and its associated semi-symmetric tensor. Based on this relation a globally ...
متن کاملOn the nonnegative inverse eigenvalue problem of traditional matrices
In this paper, at first for a given set of real or complex numbers $sigma$ with nonnegative summation, we introduce some special conditions that with them there is no nonnegative tridiagonal matrix in which $sigma$ is its spectrum. In continue we present some conditions for existence such nonnegative tridiagonal matrices.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Numerical Lin. Alg. with Applic.
دوره 19 شماره
صفحات -
تاریخ انتشار 2012